منابع مشابه
Error formulas for divided difference expansions and numerical differentiation
Here, and throughout the paper, we will assume that x0 ≤ x1 ≤ . . . ≤ xn are arbitrarily spaced real values and x is any real value in the interval [x0, xn]. We refer the reader to Conte and de Boor [1 ] for basic properties of divided differences. Two things are required: evaluation of the coefficients ck; and a bound on the remainder term Rp in terms of the maximum grid spacing h := max 0≤i≤n...
متن کاملUpgrading color-difference formulas.
We propose a method to improve the prediction performance of existing color-difference formulas with additional visual data. The formula is treated as the mean function of a Gaussian process, which is trained with experimentally determined color-discrimination data. Color-difference predictions are calculated using Gaussian process regression (GPR) considering the uncertainty of the visual data...
متن کاملAcyclic Formulas and Minimal Unsatisfiability⋆
We call a boolean formula (in CNF) stable acyclic if the associated digraph is free of a certain type of cycles. We show that satisfiability and recognition are polynomial–time solvable problems for stable acyclic formulas. Further, we show that a minimal unsatisfiable formula is stable acyclic if and only if the number of clauses exceeds the number of variables exactly by one (this subclass of...
متن کاملMinimal Unsatisfiable Formulas with Bounded Clause-Variable Difference are Fixed-Parameter Tractable
The deficiency of a propositional formula F in CNF with n variables and m clauses is defined as m−n. It is known that minimal unsatisfiable formulas (unsatisfiable formulas which become satisfiable by removing any clause) have positive deficiency. Recognition of minimal unsatisfiable formulas is NP-hard, and it was shown recently that minimal unsatisfiable formulas with deficiency k can be reco...
متن کاملPolynomial-time recognition of minimal unsatisfiable formulas with fixed clause-variable difference
A formula (in conjunctive normal form) is said to be minimal unsatisfiable if it is unsatisfiable and deleting any clause makes it satisfiable. Let F(k) be the class of formulas such that the number of clauses exceeds the number of variables exactly by k. Every minimal unsatisfiable formula belongs to F(k) for some k ≥ 1. Polynomial–time algorithms are known to recognize minimal unsatisfiable f...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computational and Applied Mathematics
سال: 1977
ISSN: 0377-0427
DOI: 10.1016/s0377-0427(77)80018-6